#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 10;
const int mod = 92084931;
int n, m, x;
int a[N];
int sum[N]; // 前缀和
int tmp[N]; // 前缀和

long long merge_sort(int l, int r)
{
    if (l >= r)return 0;
    int mid = l + r >> 1;

    long long ans = (merge_sort(l, mid) + merge_sort(mid + 1, r)) % mod;

    int i = l, j = mid + 1, k = 0;
    while (i <= mid && j <= r){
        if (sum[i] < sum[j]){
            tmp[k++] = sum[i++];
            ans = (ans + r - j + 1) % mod;
        }else{
            tmp[k++] = sum[j++];
        }
    }
    while (i <= mid) tmp[k++] = sum[i++];
    while (j <= r)   tmp[k++] = sum[j++];

    for (int i = l, j = 0; i <= r; i++, j++) sum[i] = tmp[j];

    return ans % mod;
}

int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        cin >> x;
        a[i] = x - m;
        sum[i] = sum[i - 1] + a[i];
    }
    // for (int i = 0; i <= n; i++)
    // {
    //     cout << sum[i] << " ";
    // }
    // cout << '\n';

    long long res = merge_sort(0, n);
    cout << res;

    return 0;
}

//1 + 3 + 1 = 5